Speeding up Approximation with Nicer Concepts
نویسندگان
چکیده
Concept approximation is an inference service for Description Logics that provides “translations” of concept descriptions from one DL to a less expressive DL. In [4] a method for optimizing the computation of ALC-ALE-approximations of ALC-concept descriptions was introduced. The idea is to characterize a certain class of concept descriptions for which conjuncts can be approximated independently. In this paper we provide relaxed conditions for this class of ALC-concept descriptions, extend this notion to number restrictions and report on a first implementation of this method for ALCN -ALEN -approximation.
منابع مشابه
Speeding Up All-Pairwise Dynamic Time Warping Matrix Calculation
Dynamic Time Warping (DTW) is certainly the most relevant distance for time series analysis. However, its quadratic time complexity may hamper its use, mainly in the analysis of large time series data. All the recent advances in speeding up the exact DTW calculation are confined to similarity search. However, there is a significant number of important algorithms including clustering and classif...
متن کاملMethods of Speeding Up Secret Computations With Insecure Auxiliary Computer
Currently, the problem of speeding up secret computations with the help of an auxiliary computer changed and was enriched by numerous problems of computational mathematics, where a solution means an approximate solution. The main goal of this paper is to demonstrate the different methods of computing approximate solutions of some equations with help of an auxiliary computer. To show methods, we...
متن کاملCompetitive stochastic neural networks for Vector Quantization of images
A stochastic approximation to the nearest neighbour (NN) classification rule is proposed. This approximation is called Local Stochastic Competition 0.22). Some corivergence properties of LSC are discussed, and experimental results are presented. The approach shows a great potential for speeding up the codification process, with an affordable loss of codification quality.
متن کاملOn Speeding up Frequent Approximate Subgraph Mining
Frequent approximate subgraph (FAS) mining has become an interesting task with wide applications in several domains of science. Most of the previous studies have been focused on reducing the search space or the number of canonical form (CF) tests. CF-tests are commonly used for duplicate detection; however, these tests affect the efficiency of mining process because they have high computational...
متن کاملSpeeding up the Stress Analysis of Hollow Circular FGM Cylinders by Parallel Finite Element Method
In this article, a parallel computer program is implemented, based on Finite Element Method, to speed up the analysis of hollow circular cylinders, made from Functionally Graded Materials (FGMs). FGMs are inhomogeneous materials, which their composition gradually varies over volume. In parallel processing, an algorithm is first divided to independent tasks, which may use individual or shared da...
متن کامل